A Scatter Search Algorithm for Solving a Bilevel Optimization Model for Determining Highway Tolls
نویسندگان
چکیده
The problem of determining optimal tolls established on a subset of arcs in a multicommodity capacitated transportation network is presented. The problem is formulated as a bilevel optimization problem where the upper level consists of an administrator who establishes tolls in some arcs of a network, while the lower level is represented by a group of users who travel along the shortest paths with respect to the travel cost. The objective is not only to increase the tolls, but also to maintain an optimal flow on the arcs of the network in order to maximize the leader’s profit. If the leader sets very high toll values, the followers will be discouraged from using the tolled arcs, so the profit obtained from that decision is not going to be convenient for the leader. A methodology to solve this problem using optimization software at the lower level and the metaheuristic Scatter Search at the upper level is proposed.
منابع مشابه
A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
We consider the problem of determining a set of optimal tolls on the arcs of a multicommodity transportation network. The problem is formulated as a bilevel mathematical program where the upper level consists in a firm that raises revenues from tolls set on arcs of the network, while the lower level is represented by a group of users travelling on shortest paths with respect to a generalized tr...
متن کاملSimulated Annealing Approach for Solving Bilevel Programming Problem
Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...
متن کاملA Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm
The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...
متن کاملA Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers
The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...
متن کاملEFFICIENCY OF IMPROVED HARMONY SEARCH ALGORITHM FOR SOLVING ENGINEERING OPTIMIZATION PROBLEMS
Many optimization techniques have been proposed since the inception of engineering optimization in 1960s. Traditional mathematical modeling-based approaches are incompetent to solve the engineering optimization problems, as these problems have complex system that involves large number of design variables as well as equality or inequality constraints. In order to overcome the various difficultie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computación y Sistemas
دوره 19 شماره
صفحات -
تاریخ انتشار 2015